An application of effective genetic algorithms for Solving Hybrid Flow Shop Scheduling Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Application Of Effective Genetic Algorithms For Solving Hybrid Flow Shop Scheduling Problems

This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the makespan value. In recent years, much attention is given to heuristic and search techniques. Genetic algorithms (GAs) are also known as efficient heuristic and search techniques. This paper proposes an efficient genetic algorithm for hybrid flow shop scheduling problems. The proposed algorithm is tested by Carli...

متن کامل

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

Genetic Algorithms for Solving Open Shop Scheduling Problems

In this paper we investigate the use of three evolutionary based heuristics to the open shop scheduling problem. The intractability of this problem is a motivation for the pursuit of heuristics that produce approximate solutions. This work introduces three evolutionary based heuristics, namely, a permutation genetic algorithm, a hybrid genetic algorithm and a sellsh gene algorithm, and tests th...

متن کامل

Solving hybrid flow shop scheduling problems using bat algorithm

This paper investigates the multistage hybrid flow shop (HFS) scheduling problems using the new bat algorithm. A HFS is the generalisation of flowshop with multiple machines. HFS is one of the important scheduling problems that represent many industries like iron and steel, chemical, textile and ceramic industries. The HFS scheduling problems have been proved to be NP-hard. A recently developed...

متن کامل

Modeling and scheduling no-idle hybrid flow shop problems

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computational Intelligence Systems

سال: 2008

ISSN: 1875-6883

DOI: 10.2991/jnmp.2008.1.2.4